Open Constraint Satisfaction
نویسندگان
چکیده
Traditionally, constraint satisfaction has been applied in closedworld scenarios, where all choices and constraints are known from the beginning and fixed. With the Internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where choices and constraints are to be discovered from different servers in a network. We examine how such a distributed setting affects changes the assumptions underlying most CSP algorithms, and show how solvers can be augmented with an information gathering component that allows openworld constraint satisfaction. We report on experiments that show strong performance of such methods over others where gathering information and solving the CSP are separated. 1 Constraint Satisfaction in Distributed Information
منابع مشابه
New trends in constraint satisfaction, planning, and scheduling: a survey
During recent years the development of new techniques for constraint satisfaction, planning, and scheduling has received increased attention, and substantial effort has been invested in trying to exploit such techniques to find solutions to real life problems. In this paper, we present a survey on constraint satisfaction, planning and scheduling from the Artificial Intelligence point of view. I...
متن کاملYet another object-oriented constraint resolution system: an open architecture approach
In this paper we present YAFCRS, a new object-oriented constraint system which ensures backtracking-based global resolution. First, based on objects, we define a modular representation of constraint satisfaction problems and provide a general algorithmic framework to resolve them. Then, by the definition of compound constraint classes, we allow to state compound constraints on any objects. In o...
متن کاملOpen constraint programming
Traditionally, constraint satisfaction problems (CSP) have assumed closed-world scenarios where all domains and constraints are fixed from the beginning. With the Internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where domains and constraints must be discovered from different sources in a network. To model ...
متن کاملAdaptive Parallelization for Constraint Satisfaction Search
This paper introduces two adaptive paradigms that parallelize search for solutions to constraint satisfaction problems. Both are intended for any sequential solver that uses contention-oriented variable-ordering heuristics and restart strategies. Empirical results demonstrate that both paradigms improve the search performance of an underlying sequential solver, and also solve challenging proble...
متن کامل